-
1 minterm form
-
2 minterm form
Большой англо-русский и русско-английский словарь > minterm form
-
3 minterm form
1) Логика: дизъюнктивная нормальная форма2) Вычислительная техника: ДНФ -
4 minterm form
лог. дизъюнктивная нормальная форма, ДНФEnglish-Russian dictionary of computer science and programming > minterm form
-
5 form
1) форма || формировать, образовывать2) (экранный) бланк, формуляр4) матем. выражение•- form the instruction- accounting form
- analog form
- analytic form
- archive form
- Backus normal form
- Backus-Naur form
- binary quadratic form
- canonical form
- coding form
- common machine-readable form
- conjuctive normal form
- cut form
- data collection form
- description form
- digital form
- disjunctive normal form
- E form
- elemental form
- entry form
- excess form
- exponent form
- exponent-plus N form
- fanfold forms
- full conjunctive normal form
- full disjunctive normal form
- graphical form
- graphic form
- implicative normal form
- internal form
- irredundant form
- linear form
- machine-processible form
- minterm form
- name form
- nested form
- normal form
- normalized form
- plain-text form
- polyadic form
- prenex form
- quadratic form
- sentencial form
- standard form
- state-space form
- true form
- two-level formEnglish-Russian dictionary of computer science and programming > form
-
6 ДНФ
-
7 дизъюнктивная нормальная форма
Большой англо-русский и русско-английский словарь > дизъюнктивная нормальная форма
См. также в других словарях:
minterm — noun In Boolean algebra, a product term in which each variable appears once (in either its complemented or uncomplemented form). A Boolean function can be expressed, canonically, as a sum of minterms, where each minterm corresponds to a row (of… … Wiktionary
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia
K-Diagramm — Bild 1 1: Karnaugh Veitch Diagramm: ¬AB¬C¬D ∨ A¬B¬C¬D ∨ A¬B¬CD ∨ A¬BC¬D ∨ A¬BCD ∨ AB¬C¬D ∨ ABC¬D ∨ ABCD = AC ∨ B¬C¬D ∨ A¬B … Deutsch Wikipedia
KV-Algorithmus — Bild 1 1: Karnaugh Veitch Diagramm: ¬AB¬C¬D ∨ A¬B¬C¬D ∨ A¬B¬CD ∨ A¬BC¬D ∨ A¬BCD ∨ AB¬C¬D ∨ ABC¬D ∨ ABCD = AC ∨ B¬C¬D ∨ A¬B … Deutsch Wikipedia
KV-Diagramm — Bild 1 1: Karnaugh Veitch Diagramm: ¬AB¬C¬D ∨ A¬B¬C¬D ∨ A¬B¬CD ∨ A¬BC¬D ∨ A¬BCD ∨ AB¬C¬D ∨ ABC¬D ∨ ABCD = AC ∨ B¬C¬D ∨ A¬B … Deutsch Wikipedia
KV-Tafel — Bild 1 1: Karnaugh Veitch Diagramm: ¬AB¬C¬D ∨ A¬B¬C¬D ∨ A¬B¬CD ∨ A¬BC¬D ∨ A¬BCD ∨ AB¬C¬D ∨ ABC¬D ∨ ABCD = AC ∨ B¬C¬D ∨ A¬B … Deutsch Wikipedia
Karnaugh-Diagramm — Bild 1 1: Karnaugh Veitch Diagramm: ¬AB¬C¬D ∨ A¬B¬C¬D ∨ A¬B¬CD ∨ A¬BC¬D ∨ A¬BCD ∨ AB¬C¬D ∨ ABC¬D ∨ ABCD = AC ∨ B¬C¬D ∨ A¬B … Deutsch Wikipedia
Karnaugh-Veitch-Diagramm — Bild 1 1: Karnaugh Veitch Diagramm: ¬AB¬C¬D ∨ A¬B¬C¬D ∨ A¬B¬CD ∨ A¬BC¬D ∨ A¬BCD ∨ AB¬C¬D ∨ ABC¬D ∨ ABCD = AC ∨ B¬C¬D ∨ A¬B … Deutsch Wikipedia
Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… … Wikipedia
Karnaugh map — For former radio station KMAP (1962 1968) in Dallas Fort Worth, see KRLD FM. An example Karnaugh map The Karnaugh map (K map for short), Maurice Karnaugh s 1953 refinement of Edward Veitch s 1952 Veitch diagram, is a method to simplify Boolean… … Wikipedia
Bündelminimierung — Das Verfahren nach Quine und McCluskey (QMCV, nach Willard Van Orman Quine und Edward J. McCluskey) ist eine Methode, um Boolesche Funktionen zu minimieren. Der Kern des Verfahrens wurde bereits von Quine vollständig beschrieben. Die… … Deutsch Wikipedia